An infeasible solutions diversity maintenance epsilon constraint handling method for evolutionary constrained multiobjective optimization

نویسندگان

چکیده

It is well known that it very difficult to solve constrained multiobjective optimization problems. Such problems not only need optimize the objective function but also consider constraints. The epsilon constraint handling method commonly used, which releases degree of violations by defining a gradually decayed epsilon. However, for solutions whose overall greater than epsilon, original cannot guarantee diversity and are considered. To this issue, paper proposed an infeasible maintenance strategy experimental results show our algorithm competitive with other state-of-the-art algorithms

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-Handling using an Evolutionary Multiobjective Optimization Technique

In this paper, we introduce the concept of non-dominance (commonly used in multiobjective optimization) as a way to incorporate constraints into the tness function of a genetic algorithm. Each individual is assigned a rank based on its degree of dominance over the rest of the population. Feasible individuals are always ranked higher than infeasible ones, and the degree of constraint violation d...

متن کامل

An Improved Epsilon Constraint-handling Method in MOEA/D for CMOPs with Large Infeasible Regions

This paper proposes an improved epsilon constraint-handling mechanism, and combines it with a decomposition-based multi-objective evolutionary algorithm (MOEA/D) to solve constrained multi-objective optimization problems (CMOPs). The proposed constrained multi-objective evolutionary algorithm (CMOEA) is named MOEA/D-IEpsilon. It adjusts the epsilon level dynamically according to the ratio of fe...

متن کامل

Multiobjective Optimization and Multiple Constraint Handling with Evolutionary Algorithms

In this talk, fitness assignment in multiobjective evolutionary algorithms is interpreted as a multi-criterion decision process. A suitable decision making framework based on goals and priorities is formulated in terms of a relational operator, characterized, and shown to encompass a number of simpler decision strategies, including constraint satisfaction, lexicographic optimization, and a form...

متن کامل

Constraint Method-Based Evolutionary Algorithm (CMEA) for Multiobjective Optimization

Evolutionary algorithms are becoming increasingly valuable in solving large-scale, realistic engineering multiobjective optimization (MO) problems, which typically require consideration of conflicting and competing design issues. The new procedure, Constraint Method-Based Evolutionary Algorithm (CMEA), presented in this paper is based upon underlying concepts in the constraint method described ...

متن کامل

Cylindrical Constraint Evolutionary Algorithm for Multiobjective Optimization

This paper introduces a new iterative evolutionary algorithm, which is able to provide an evenly distributed set of solutions in multiobjective context. The method is different from the other evolutionary algorithms in two perspectives. First, instead of density information incorporated to find a diverse set of solutions, a hypercylinder is introduced as a new constraint to the problem. Searchi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2021

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-021-05880-5